Longest common subsequence in sublinear space
نویسندگان
چکیده
We present the first o(n)-space polynomial-time algorithm for computing length of a longest common subsequence. Given two strings n, runs in O(n3) time with O(nlog1.5?n2log?n) bits space.
منابع مشابه
Longest Common Extensions in Sublinear Space
The longest common extension problem (LCE problem) is to construct a data structure for an input string T of length n that supports LCE(i, j) queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions i and j in T . This classic problem has a well-known solution that uses O(n) space and O(1) query time. In this paper we show that for any trade-of...
متن کاملSublinear Space Algorithms for the Longest Common Substring Problem
Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92]). However, the use of linear space is impractical in many applications. In this paper we show that for any trade-...
متن کاملRepetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms.
متن کاملThe Longest Common Subsequence Problem
Algorithms on sequences of symbols have been studied for a long time and now form a fundamental part of computer science. One of the very important problems in analysis of sequences is the longest common subsequence problem. For the general case of an arbitrary number of input sequences, the problem is NP-hard. We describe an approach to solve this problem. This approach is based on constructin...
متن کاملLongest Common Subsequence in k Length Substrings
In this paper we define a new problem, motivated by computational biology, LCSk aiming at finding the maximal number of k length substrings, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where k = 1. We provide an algorithm, solving the general case in O(n) time, where n is the length of the input stri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2021
ISSN: ['1872-6119', '0020-0190']
DOI: https://doi.org/10.1016/j.ipl.2020.106084